package Problem;

import java.util.Scanner;

//
// Created by ✎﹏ℳ๓独赏☆独醉 on 2024/1/17.
// 
public class 修剪灌木 {
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        final int num = scan.nextInt();
        int[] arr = new int[num];
        int[] max = new int[num];
        do {
            for (int i = 0; i < num-1; i++) {
                growth(arr);
                getMax(arr, max);
                arr[i] = 0;
            }
            for (int i = num - 1; i > 0; i--) {
                growth(arr);
                getMax(arr, max);
                arr[i] = 0;
            }
        } while (!isBreak(arr, max));
        for (int i = 0; i < num; i++) {
            System.out.println(max[i]);
        }
    }

    private static void growth(int[] arr) {
        for (int i = 0; i < arr.length; i++) {
            arr[i]++;
        }
    }

    public static void getMax(int[] arr,int[] max){
        for (int i = 0; i < arr.length; i++) {
            if(arr[i] > max[i]){
                max[i] = arr[i];
            }
        }
    }
    public static boolean isBreak(int[] arr, int[] max){
        for (int i = 0; i < arr.length; i++) {
            if(arr[i] >= max[i]){
                return false;
            }
        }
        return true;
    }
}
